System and Method for the Scheduling of Load Instructions Within a Group Priority Issue Schema for a Cascaded Pipeline

ABSTRACT

The present invention provides system and method for a group priority issue schema for a cascaded pipeline. The system includes a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The system further includes circuitry configured to: (1) receive an issue group of instructions; (2) determine if at least one load instruction is in the issue group, if so scheduling the least one load instruction in a first pipeline based upon a priority list; and (3) schedule execution of the issue group of instructions in the cascaded delayed execution pipeline unit.

CROSS-REFERENCE TO RELATED APPLICATION

This application is related to co-pending U.S. patent applicationsentitled “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUP PRIORITYISSUE SCHEMA FOR A CASCADED PIPELINE” filed on ______, 2008, by DavidArnold Luick, having Attorney docket # ROC920070374US1 and accorded Ser.No. [______], “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUPPRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE” filed on ______, 2008, byDavid Arnold Luick et al., having Attorney docket # ROC920070375US1 andaccorded Ser. No. [______], “SYSTEM AND METHOD FOR RESOLVING ISSUECONFLICTS OF LOAD INSTRUCTIONS” filed on ______, 2008, by David ArnoldLuick, having Attorney docket # ROC920070558US1 and accorded Ser. No.[______], “SYSTEM AND METHOD FOR PRIORITIZING FLOATING-POINTINSTRUCTIONS” filed on ______, 2008, by David Arnold Luick, havingAttorney docket # ROC920070559US1 and accorded Ser. No. [______],“SYSTEM AND METHOD FOR PRIORITIZING ARITHMETIC INSTRUCTIONS” filed on______, 2008, by David Arnold Luick, having Attorney docket #ROC920070560US1 and accorded Ser. No. [______], “SYSTEM AND METHOD FORPRIORITIZING STORE INSTRUCTIONS” filed on ______, 2008, by David ArnoldLuick, having Attorney docket # ROC920070561US1 and accorded Ser. No.[______], “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUP PRIORITYISSUE SCHEMA FOR A CASCADED PIPELINE ” filed on ______, 2008, by DavidArnold Luick, having Attorney docket # ROC920070686US1 and accorded Ser.No. [______], “SYSTEM AND METHOD FOR RESOLVING ISSUE CONFLICTS OF LOADINSTRUCTIONS” filed on ______, 2008, by David Arnold Luick, havingAttorney docket # ROC920070688US1 and accorded Ser. No. [______],“SYSTEM AND METHOD FOR PRIORITIZING COMPARE INSTRUCTIONS” filed on______, 2008, by David Arnold Luick, having Attorney docket #ROC920070689US1 and accorded serial number [______], “SYSTEM AND METHODFOR PRIORITIZING BRANCH INSTRUCTIONS” filed on ______, 2008, by DavidArnold Luick, having Attorney docket # ROC920070691US1 and accorded Ser.No. [______], “SYSTEM AND METHOD FOR OPTIMIZATION WITHIN A GROUPPRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE” filed on ______, 2008, byDavid Arnold Luick, having Attorney docket # ROC920070693US1 andaccorded Ser. No. [______], all of which are entirely incorporatedherein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention generally relates to executing instructions in aprocessor. Specifically, this application is related to scheduling ofload instructions within a group priority issue schema for a cascadedpipeline.

2. Description of Background

Currently, modern computer systems typically contain several integratedcircuits (ICs), including a processor which may be used to processinformation in the computer system. The data processed by a processormay include computer instructions which are executed by the processor aswell as data which is manipulated by the processor using the computerinstructions. The computer instructions and data are typically stored ina main memory in the computer system.

Processors typically process instructions by executing the instructionin a series of small steps. In some cases, to increase the number ofinstructions being processed by the processor (and therefore increasethe speed of the processor), the processor may be pipelined. Pipeliningrefers to providing separate stages in a processor where each stageperforms one or more of the small steps necessary to execute aninstruction. In some cases, the pipeline (in addition to othercircuitry) may be placed in a portion of the processor referred to asthe processor core. Some processors may have multiple processor cores,and in some cases, each processor core may have multiple pipelines.Where a processor core has multiple pipelines, groups of instructions(referred to as issue groups) may be issued to the multiple pipelines inparallel and executed by each of the pipelines in parallel.

As an example of executing instructions in a pipeline, when a firstinstruction is received, a first pipeline stage may process a small partof the instruction. When the first pipeline stage has finishedprocessing the small part of the instruction, a second pipeline stagemay begin processing another small part of the first instruction whilethe first pipeline stage receives and begins processing a small part ofa second instruction. Thus, the processor may process two or moreinstructions at the same time (in parallel).

To provide for faster access to data and instructions as well as betterutilization of the processor, the processor may have several caches. Acache is a memory which is typically smaller than the main memory and istypically manufactured on the same die (i.e., chip) as the processor.Modern processors typically have several levels of caches. The fastestcache which is located closest to the core of the processor is referredto as the Level 1 cache (L1 cache). In addition to the L1 cache, theprocessor typically has a second, larger cache, referred to as the Level2. Cache (L2 cache). In some cases, the processor may have other,additional cache levels (e.g., an L3 cache and an L4 cache).

To provide the processor with enough instructions to fill each stage ofthe processor's pipeline, the processor may retrieve instructions fromthe L2 cache in a group containing multiple instructions, referred to asan instruction line (I-line). The retrieved I-line may be placed in theL1 instruction cache (I-cache) where the core of the processor mayaccess instructions in the I-line. Blocks of data (D-lines) to beprocessed by the processor may similarly be retrieved from the L2 cacheand placed in the L1 cache data cache (D-cache).

The process of retrieving information from higher cache levels andplacing the information in lower cache levels may be referred to asfetching, and typically requires a certain amount of time (latency). Forinstance, if the processor core requests information and the informationis not in the L1 cache (referred to as a cache miss), the informationmay be fetched from the L2 cache. Each cache miss results in additionallatency as the next cache/memory level is searched for the requestedinformation. For example, if the requested information is not in the L2cache, the processor may look for the information in an L3 cache or inmain memory.

In some cases, a processor may process instructions and data faster thanthe instructions and data are retrieved from the caches and/or memory.For example, where an instruction being executed in a pipeline attemptsto access data which is not in the D-cache, pipeline stages may finishprocessing previous instructions while the processor is fetching aD-line which contains the data from higher levels of cache or memory.When the pipeline finishes processing the previous instructions whilewaiting for the appropriate D-line to be fetched, the pipeline may haveno instructions left to process (referred to as a pipeline stall). Whenthe pipeline stalls, the processor is underutilized and loses thebenefit that a pipelined processor core provides.

Because the address of the desired data may not be known until theinstruction is executed, the processor may not be able to search for thedesired D-line until the instruction is executed. However, someprocessors may attempt to prevent such cache misses by fetching a blockof D-lines which contain data addresses near (contiguous to) a dataaddress which is currently being accessed. Fetching nearby D-linesrelies on the assumption that when a data address in a D-line isaccessed, nearby data addresses will likely also be accessed as well(this concept is generally referred to as locality of reference).However, in some cases, the assumption may prove incorrect, such thatdata in D-lines which are not located near the current D-line areaccessed by an instruction, thereby resulting in a cache miss andprocessor inefficiency.

Accordingly, there is a need for improved methods and apparatus forexecuting instructions and retrieving data in a processor which utilizescached memory.

SUMMARY OF THE INVENTION

Embodiments of the present invention provide a system and method forscheduling of load instructions within a group priority issue schema fora cascaded pipeline. Briefly described, in architecture, one embodimentof the system, among others, can be implemented as follows.

The system includes a cascaded delayed execution pipeline unit having aplurality of execution pipelines that execute instructions in a commonissue group in a delayed manner relative to each other. The systemfurther includes circuitry configured to: (1) receive an issue group ofinstructions; (2) determine if at least one load instruction is in theissue group, if so scheduling the least one load instruction in a firstpipeline based upon a priority list; and (3) schedule execution of theissue group of instructions in the cascaded delayed execution pipelineunit.

Embodiment of the present invention can also be viewed as providingmethods for scheduling of load instructions within a group priorityissue schema for a cascaded pipeline. In this regard, one embodiment ofsuch a method, among others, can be broadly summarized by the followingsteps. The method includes receiving an issue group of instructions anddetermining if at least one load instruction is in the issue group, ifso scheduling the least one load instruction in a first pipeline basedupon a priority list. The method further includes scheduling executionof the issue group of instructions in the cascaded delayed executionpipeline unit.

Additional features and advantages are realized through the techniquesof the present invention. Other embodiments and aspects of the inventionare described in detail herein and are considered a part of the claimedinvention. For a better understanding of the invention with advantagesand features, refer to the description and to the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter which is regarded as the invention is particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The foregoing and other objects, features, andadvantages of the invention are apparent from the following detaileddescription taken in conjunction with the accompanying drawings inwhich:

FIG. 1 is a block diagram depicting a system according to one embodimentof the invention.

FIG. 2 is a block diagram depicting a computer processor according toone embodiment of the invention.

FIG. 3 is a block diagram depicting one of the cores of the processoraccording to one embodiment of the invention.

FIG. 4 is a block diagram depicting an instruction prioritizationcircuitry according to one embodiment of the invention.

FIG. 5 is a flow chart illustrating an example of the operation of loadinstruction scheduling process in the delayed execution pipelineaccording to one embodiment of the invention.

The detailed description explains the preferred embodiments of theinvention, together with advantages and features, by way of example withreference to the drawings.

DETAILED DESCRIPTION OF THE INVENTION

For cascaded delayed pipeline issue, instructions are in generalassigned to the leftmost possible delayed pipeline that will cause zeroinstruction execution bubbles; loads have the highest priority for thisassignment, then arithmetic instructions (ALU and MAD ops) are the nextpriority. Stores, branches, and compares are assigned last and ingeneral may be assigned to any delayed pipeline without loss ofperformance. The apparatus and method to implement this optimizationwithin a group priority issue scheme for cascaded pipelines aredescribed in commonly assigned and co-pending U.S. patent application(Attorney Docket ROC920070374US1) entitled “SYSTEM AND METHOD FOROPTIMIZATION WITHIN A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADEDPIPELINE”, Ser. No. ______ filed on, ______, 2008, and U.S. patentapplication (Attorney Docket ROC920070374US1) entitled “SYSTEM ANDMETHOD FOR A GROUP PRIORITY ISSUE SCHEMA FOR A CASCADED PIPELINE”, Ser.No. ______ filed on, ______, 2008, are both herein incorporated byreference.

Sometimes, multiple load instructions (or multiple arithmeticinstructions) will want to be assigned to the same delayed pipeline. Inthis disclosure, a second level priority scheme is invoked which ranksvarious types of loads/load attributes into a number of categories,typically ten.

The load priorities include parameters such as loads for LARX loads thatreset a lock SMP semaphore (reservation reg.), loads with a predictableload miss in the D-Cache, loads with unpredictable load miss in theD-Cache, loads with an address conflict with an earlier storeinstruction already in the pipeline, loads with multiple dependent loads(or multiplies) following it on a dependent chain, loads with 1dependent load (or multiply) following it on a dependent chain, loadswith 3 or more dependent ALU instructions following it on a dependentchain, loads with update (auto increment) that have both RT and RA(2)target results, loads with 1 dependent use of any kind but not by an EOCtype instruction, loads with a dependent use by only an EOC type ofinstruction, and loads that do not have a dependent reference of theirtarget within the depth of the IQ.

So, based on this priority, lower priority loads will be assigned to amore delayed pipeline than the original zero bubble method haddetermined. But also, cases exist where two similar high priority loadswant to be naively assigned to the same leftmost possible pipeline butthe second of these two loads will alternatively be scheduled in thenext instruction group with the current instruction group terminated.

The present invention generally provides a mechanism and method for apriority scheme which ranks various types of loads/load attributes intoa number of categories. In one embodiment, a method of schedulingexecution of an instruction in a processor is provided. The processormay have at least one cascaded delayed execution pipeline unit havingtwo or more execution pipelines that execute instructions in a commonissue group in a delayed manner relative to each other.

The method includes receiving an issue group of instructions, separatingthe instructions by relative priority (e.g., loads are highest priority,then ALU ops, then stores and compares, lastly branches). So, allpossible loads are picked out and run first. This is done by puttingthem in the left most pipes as possible. Then ALU ops are grouped next,and assign to leftward pipes which aren't otherwise occupied. Stores andmost branches can be put in any remaining pipes. By executing theinstruction in the delayed execution pipeline, and by initiating the L2cache access when the instruction is issued, the data targeted by theinstruction may be retrieved, if necessary, from the L2 cache in timefor the instruction to use the data without stalling execution of theinstruction.

In the following, reference is made to embodiments of the invention.However, it should be understood that the invention is not limited tospecific described embodiments. Instead, any combination of thefollowing features and elements, whether related to differentembodiments or not, is contemplated to implement and practice theinvention. Furthermore, in various embodiments the invention providesnumerous advantages over the prior art. However, although embodiments ofthe invention may achieve advantages over other possible solutionsand/or over the prior art, whether or not a particular advantage isachieved by a given embodiment is not limiting of the invention. Thus,the following aspects, features, embodiments and advantages are merelyillustrative and are not considered elements or limitations of theappended claims except where explicitly recited in the claim(s).Likewise, reference to “the invention” shall not be construed as ageneralization of any inventive subject matter disclosed herein andshall not be considered to be an element or limitation of the appendedclaims except where explicitly recited in a claim(s).

The following is a detailed description of embodiments of the inventiondepicted in the accompanying drawings. The embodiments are examples andare in such detail as to clearly communicate the invention. However, theamount of detail offered is not intended to limit the anticipatedvariations of embodiments; but on the contrary, the intention is tocover all modifications, equivalents, and alternatives falling withinthe spirit and scope of the present invention as defined by the appendedclaims.

Embodiments of the invention may be utilized with and are describedbelow with respect to a system, e.g., a computer system. As used herein,a system may include any system utilizing a processor and a cachememory, including a personal computer, internet appliance, digital mediaappliance, portable digital assistant (PDA), portable music/video playerand video game console. While cache memories may be located on the samedie as the processor which utilizes the cache memory, in some cases, theprocessor and cache memories may be located on different dies (e.g.,separate chips within separate modules or separate chips within a singlemodule).

While described below with respect to a processor having multipleprocessor cores and multiple L1 caches, wherein each processor core usesmultiple pipelines to execute instructions, embodiments of the inventionmay be utilized with any processor which utilizes a cache, includingprocessors which have a single processing core. In general, embodimentsof the invention may be utilized with any processor and are not limitedto any specific configuration. Furthermore, while described below withrespect to a processor having an L1-cache divided into an L1 instructioncache (L1 I-cache, or I-cache) and an L1 data cache (L1 D-cache, orD-cache), embodiments of the invention may be utilized in configurationswherein a unified L1 cache is utilized.

FIG. 1 is a block diagram illustrating an example of a computer 11utilizing the load priority issue process 200 of the present invention.Computer 11 includes, but is not limited to, PCs, workstations, laptops,PDAs, palm devices and the like. Generally, in terms of hardwarearchitecture, as shown in FIG. 1, the computer 11 include a processor41, memory 42, and one or more input and/or output (I/O) devices (orperipherals) that are communicatively coupled via a local interface 43.The local interface 43 can be, for example but not limited to, one ormore buses or other wired or wireless connections, as is known in theart. The local interface 43 may have additional elements, which areomitted for simplicity, such as controllers, buffers (caches), drivers,repeaters, and receivers, to enable communications. Further, the localinterface 43 may include address, control, and/or data connections toenable appropriate communications among the aforementioned components.

The processor 41 is a hardware device for executing software that can bestored in memory 42. The processor 41 can be virtually any custom madeor commercially available processor, a central processing unit (CPU),data signal processor (DSP) or an auxiliary processor among severalprocessors associated with the computer 11, and a semiconductor basedmicroprocessor (in the form of a microchip) or a macroprocessor.Examples of suitable commercially available microprocessors are asfollows: a PowerPC microprocessor from IBM, U.S.A., an 80x86 or Pentiumseries microprocessor from Intel Corporation, U.S.A., a Sparcmicroprocessor from Sun Microsystems, Inc, a PA-RISC seriesmicroprocessor from Hewlett-Packard Company, U.S.A., or a 68xxx seriesmicroprocessor from Motorola Corporation, U.S.A.

The memory 42 can include any one or combination of volatile memoryelements (e.g., random access memory (RAM, such as dynamic random accessmemory (DRAM), static random access memory (SRAM), etc.)) andnonvolatile memory elements (e.g., ROM, erasable programmable read onlymemory (EPROM), electronically erasable programmable read only memory(EEPROM), programmable read only memory (PROM), tape, compact disc readonly memory (CD-ROM), disk, diskette, cartridge, cassette or the like,etc.). Moreover, the memory 42 may incorporate electronic, magnetic,optical, and/or other types of storage media. Note that the memory 42can have a distributed architecture, where various components aresituated remote from one another, but can be accessed by the processor41.

The software in memory 42 may include one or more separate programs,each of which comprises an ordered listing of executable instructionsfor implementing logical functions. In the example illustrated in FIG.1, the software in the memory 42 includes a suitable operating system(O/S) 51. The operating system 51 essentially controls the execution ofother computer programs, and provides scheduling, input-output control,file and data management, memory management, and communication controland related services.

A non-exhaustive list of examples of suitable commercially availableoperating systems 51 is as follows (a) a Windows operating systemavailable from Microsoft Corporation; (b) a Netware operating systemavailable from Novell, Inc.; (c) a Macintosh operating system availablefrom Apple Computer, Inc.; (e) a UNIX operating system, which isavailable for purchase from many vendors, such as the Hewlett-PackardCompany, Sun Microsystems, Inc., and AT&T Corporation; (d) a Linuxoperating system, which is freeware that is readily available on theInternet; (e) a run time Vxworks operating system from WindRiverSystems, Inc.; or (f) an appliance-based operating system, such as thatimplemented in handheld computers or personal data assistants (PDAs)(e.g., Symbian OS available from Symbian, Inc., PalmOS available fromPalm Computing, Inc., and Windows CE available from MicrosoftCorporation).

The I/O devices may include input devices, for example but not limitedto, a mouse 44, keyboard 45, scanner (not shown), microphone (notshown), etc. Furthermore, the I/O devices may also include outputdevices, for example but not limited to, a printer (not shown), display46, etc. Finally, the I/O devices may further include devices thatcommunicate both inputs and outputs, for instance but not limited to, aNIC or modulator/demodulator 47 (for accessing remote devices, otherfiles, devices, systems, or a network), a radio frequency (RF) or othertransceiver (not shown), a telephonic interface (not shown), a bridge(not shown), a router (not shown), etc.

If the computer 11 is a PC, workstation, intelligent device or the like,the software in the memory 42 may further include a basic input outputsystem (BIOS) (omitted for simplicity). The BIOS is a set of essentialsoftware routines that initialize and test hardware at startup, startthe O/S 51, and support the transfer of data among the hardware devices.The BIOS is stored in some type of read-only-memory, such as ROM, PROM,EPROM, EEPROM or the like, so that the BIOS can be executed when thecomputer 11 is activated.

When the computer 11 is in operation, the processor 41 is configured toexecute software stored within the memory 42, to communicate data to andfrom the memory 42, and to generally control operations of the computer11 are pursuant to the software. The O/S 51 and any other program areread, in whole or in part, by the processor 41, perhaps buffered withinthe processor 41, and then executed.

According to one embodiment of the invention, the processor 41 may havean L2 cache 61 as well as multiple L1 caches 71, with each L1 cache 71being utilized by one of multiple processor cores 81. According to oneembodiment, each processor core 81 may be pipelined, wherein eachinstruction is performed in a series of small steps with each step beingperformed by a different pipeline stage.

FIG. 2 is a block diagram depicting a processor 41 according to oneembodiment of the invention. For simplicity, FIG. 2 depicts and isdescribed with respect to a single processor core 81 of the processor41. In one embodiment, each processor core 81 may be identical (e.g.,contain identical pipelines with identical pipeline stages). In anotherembodiment, each processor core 81 may be different (e.g., containdifferent pipelines with different stages).

In one embodiment of the invention, the L2 cache may contain a portionof the instructions and data being used by the processor 41. In somecases, the processor 41 may request instructions and data which are notcontained in the L2 cache 61. Where requested instructions and data arenot contained in the L2 cache 61, the requested instructions and datamay be retrieved (either from a higher level cache or system memory 42)and placed in the L2 cache. When the processor core 81 requestsinstructions from the L2 cache 61, the instructions may be firstprocessed by a predecoder and scheduler 63 (described below in greaterdetail).

In one embodiment of the invention, instructions may be fetched from theL2 cache 61 in groups, referred to as I-lines. Similarly, data may befetched from the L2 cache 61 in groups referred to as D-lines. The L1cache 71 depicted in FIG. 1 may be divided into two parts, an L1instruction cache 72 (L1 I-cache 72) for storing I-lines as well as anL1 data cache 74 (D-cache 74) for storing D-lines. I-lines and D-linesmay be fetched from the L2 cache 61 using L2 access circuitry 62.

In one embodiment of the invention, I-lines retrieved from the L2 cache61 may be processed by a predecoder and scheduler 63 and the I-lines maybe placed in the L1 I-cache 72. To further improve processorperformance, instructions are often predecoded, for example, I-lines areretrieved from L2 (or higher) cache. Such predecoding may includevarious functions, such as address generation, branch prediction, andscheduling (determining an order in which the instructions should beissued), which is captured as dispatch information (a set of flags) thatcontrol instruction execution. In some cases, the predecoder andscheduler 63 may be shared among multiple processor cores 81 and L1caches. Similarly, D-lines fetched from the L2 cache 61 may be placed inthe D-cache 74. A bit in each I-line and D-line may be used to trackwhether a line of information in the L2 cache 61 is an I-line or D-line.Optionally, instead of fetching data from the L2 cache 61 in I-linesand/or D-lines, data may be fetched from the L2 cache 61 in othermanners, e.g., by fetching smaller, larger, or variable amounts of data.

In one embodiment, the L1 I-cache 72 and D-cache 74 may have an I-cachedirectory 73 and D-cache directory 75 respectively to track whichI-lines and D-lines are currently in the L1 I-cache 72 and D-cache 74.When an I-line or D-line is added to the L1 I-cache 72 or D-cache 74, acorresponding entry may be placed in the I-cache directory 73 or D-cachedirectory 75. When an I-line or D-line is removed from the L1 I-cache 72or D-cache 74, the corresponding entry in the I-cache directory 73 orD-cache directory 75 may be removed. While described below with respectto a D-cache 74 which utilizes a D-cache directory 75, embodiments ofthe invention may also be utilized where a D-cache directory 75 is notutilized. In such cases, the data stored in the D-cache 74 itself mayindicate what D-lines are present in the D-cache 74.

In one embodiment, instruction fetching circuitry 89 may be used tofetch instructions for the processor core 81. For example, theinstruction fetching circuitry 89 may contain a program counter whichtracks the current instructions being executed in the core. A branchunit within the core may be used to change the program counter when abranch instruction is encountered. An I-line buffer 82 may be used tostore instructions fetched from the L1 I-cache 72.

Instruction prioritization circuitry 83 may be used for optimizationswhich may be achieved from the ordering of instructions as described ingreater detail below with regard to FIGS. 4 and 5. The instructionprioritization circuitry can implement any number of differentinstruction optimization schemes, including the one of the presentinvention, which is to prioritize the instructions according to thepriority order of the load instruction class. Issue and dispatchcircuitry 84 may be used to group instructions retrieved from theinstruction prioritization circuitry. 83 into instruction groups whichmay then be issued to the processor core 81 as described below. In somecases, the issue and dispatch circuitry may use information provided bythe predecoder and scheduler 63 to form appropriate instruction groups.

In addition to receiving instructions from the issue and dispatchcircuitry 84, the processor core 81 may receive data from a variety oflocations. Where the processor core 81 requires data from a dataregister, a register file 86 may be used to obtain data. Where theprocessor core 81 requires data from a memory location, cache load andstore circuitry 87 may be used to load data from the D-cache 74. Wheresuch a load is performed, a request for the required data may be issuedto the D-cache 74. At the same time, the D-cache directory 75 may bechecked to determine whether the desired data is located in the D-cache74. Where the D-cache 74 contains the desired data, the D-cachedirectory 75 may indicate that the D-cache 74 contains the desired dataand the D-cache access may be completed at some time afterwards. Wherethe D-cache 74 does not contain the desired data, the D-cache directory75 may indicate that the D-cache 74 does not contain the desired data.Because the D-cache directory 75 may be accessed more quickly than theD-cache 74, a request for the desired data may be issued to the L2 cache61 (e.g., using the L2 access circuitry 62) after the D-cache directory75 is accessed but before the D-cache access is completed.

In some cases, data may be modified in the processor core 81. Modifieddata may be written to the register file 86, or stored in memory 42(FIG. 1). Write-back circuitry 88 may be used to write data back to theregister file 86. In some cases, the write-back circuitry 88 may utilizethe cache load and store circuitry 87 to write data back to the D-cache74. Optionally, the processor core 81 may access the cache load andstore circuitry 87 directly to perform stores. In some cases, asdescribed below, the write-back circuitry 88 may also be used to writeinstructions back to the L1 I-cache 72.

As described above, the issue and dispatch circuitry 84 may be used toform instruction groups and issue the formed instruction groups to theprocessor core 81. The issue and dispatch circuitry 84 may also includecircuitry to rotate and merge instructions in the I-line and therebyform an appropriate instruction group. Formation of issue groups maytake into account several considerations, such as dependencies betweenthe instructions in an issue group. Once an issue group is formed, theissue group may be dispatched in parallel to the processor core 81. Insome cases, an instruction group may contain one instruction for eachpipeline in the processor core 81. Optionally, the instruction group maya smaller number of instructions.

According to one embodiment of the invention, one or more processorcores 81 may utilize a cascaded, delayed execution pipelineconfiguration. In the example depicted in FIG. 3, the processor core 81contains four pipelines in a cascaded configuration. Optionally, asmaller number (two or more pipelines) or a larger number (more thanfour pipelines) may be used in such a configuration. Furthermore, thephysical layout of the pipeline depicted in FIG. 3 is exemplary, and notnecessarily suggestive of an actual physical layout of the cascaded,delayed execution pipeline unit.

In one embodiment, each pipeline (P0, P1, P2, and P3) in the cascaded,delayed execution pipeline configuration may contain an execution unit94. In the example depicted in FIG. 3, pipeline P0 is the shortest delaypipeline, and pipeline P3 is the longest delay pipeline in the cascaded,delayed execution pipeline configuration. The execution unit 94 maycontain several pipeline stages which perform one or more functions fora given pipeline. For example, the execution unit 94 may perform all ora portion of the fetching and decoding of an instruction. The decodingperformed by the execution unit may be shared with a predecoder andscheduler 63 which is shared among multiple processor cores 81 or,optionally, which is utilized by a single processor core 81. Theexecution unit may also read data from a register file, calculateaddresses, perform integer arithmetic functions (e.g., using anarithmetic logic unit, or ALU), perform floating point arithmeticfunctions, execute instruction branches, perform data access functions(e.g., loads and stores from memory), and store data back to registers(e.g., in the register file 86). In some cases, the processor core 81may utilize an instruction fetching circuitry 89, the register file 86,cache load and store circuitry 87, and write-back circuitry 88, as wellas any other circuitry, to perform these functions.

In one embodiment, each execution unit 94 may perform the samefunctions. Optionally, each execution unit 94 (or different groups ofexecution units) may perform different sets of functions. Also, in somecases the execution units 94 in each processor core 81 may be the sameor different from execution units 94 provided in other cores. Forexample, in one core, execution units 94A and 94C may perform load/storeand arithmetic functions while execution units 94B, and 94D may performonly arithmetic functions.

In one embodiment, as depicted, execution in the execution units 94 maybe performed in a delayed manner with respect to the other executionunits 94. The depicted arrangement may also be referred to as acascaded, delayed configuration, but the depicted layout is notnecessarily indicative of an actual physical layout of the executionunits. In such a configuration, where instructions (referred to, forconvenience, as I0, I1, I2, I3) in an instruction group are issued inparallel to the pipelines P0, P1, P2, P3, each instruction may beexecuted in a delayed fashion with respect to each other instruction.For example, instruction I0 may be executed first in the execution unit94A for pipeline P0, instruction I1 may be executed second in theexecution unit 94B, for pipeline P1, and so on.

In one embodiment, upon issuing the issue group to the processor core81, I0 may be executed immediately in execution unit 94A. Later, afterinstruction I0 has finished being executed in execution unit 94A,execution unit 94B, may begin executing instruction I1, and so on, suchthat the instructions issued in parallel to the processor core 81 areexecuted in a delayed manner with respect to each other.

In one embodiment, some execution units 94 may be delayed with respectto each other while other execution units 94 are not delayed withrespect to each other. Where execution of a second instruction isdependent on the execution of a first instruction, forwarding paths 98may be used to forward the result from the first instruction to thesecond instruction. The depicted forwarding paths 98 are merelyexemplary, and the processor core 81 may contain more forwarding pathsfrom different points in an execution unit 94 to other execution units94 or to the same execution unit 94.

In one embodiment, instructions which are not being executed by anexecution unit 94 (e.g., instructions being delayed) may be held in adelay queue 92 or a target delay queue 96. The delay queues 92 may beused to hold instructions in an instruction group which have not beenexecuted by an execution unit 94. For example, while instruction I0 isbeing executed in execution unit 94A, instructions I1, I2, and I3 may beheld in a delay queue 96. Once the instructions have moved through thedelay queues 96, the instructions may be issued to the appropriateexecution unit 94 and executed. The target delay queues 96 may be usedto hold the results of instructions which have already been executed byan execution unit 94. In some cases, results in the target delay queues96 may be forwarded to executions units 94 for processing or invalidatedwhere appropriate. Similarly, in some circumstances, instructions in thedelay queue 92 may be invalidated, as described below.

In one embodiment, after each of the instructions in an instructiongroup have passed through the delay queues 92, execution units 94, andtarget delay queues 96, the results (e.g., data, and, as describedbelow, instructions) may be written back either to the register file 86or the L1 I-cache 72 and/or D-cache 74. In some cases, the write-backcircuitry 88 may be used to write back the most recently modified valueof a register (received from one of the target delay queues 96) anddiscard invalidated results.

Scheduling Load Instructions

According to one embodiment of the invention, pipeline stalls due tocache misses may be reduced by executing high priority load instructionsin the least delayed pipeline (e.g., in the example described above, inpipeline P₀). Where the load instruction results in a D-cache miss,instructions issued after the load instruction may be invalidated and arequest for data may be sent to the L2 cache 61. While the desired datais being fetched from the L2 cache 61, the load instruction may bereissued to the pipeline (e.g., pipeline P3) with the greatest delay inexecution, and the invalidated instructions may be issued, either in thesame issue group with the reissued instruction or in subsequent issuegroups.

In the case where load issue conflicts occur (i.e. two or more loadinstructions issue to the same pipeline), a prioritization or tiebreakerprocess is performed. This prioritization or tiebreaker process is todetermine which of the load issue conflict instructions is placed in theleast delayed pipeline and the other load instructions are placed inmore delayed pipelines. In one embodiment of the invention, the loadinstructions are prioritized with regard to program order.

Executing the load instruction as described above may be beneficial inat least three respects. First, by initially executing the high priorityload instruction in the pipeline with the least delay in execution, adetermination may be made quickly of whether the load instructionresults in a D-cache miss. With an early determination of whether aD-cache miss results, fewer instructions issued to the pipeline (e.g.,instructions in subsequent issue groups) may be invalidated andreissued. Second, by quickly determining whether the issued instructionresults in an L1 cache miss, an L2 cache access may be initiated morequickly, thereby reducing any resulting stall in the pipeline while theL2 cache access is performed. Third, by reissuing the load instructionto the pipeline with the greatest delay, more time (e.g., while the loadinstruction is being moved through the delay queue 92 and before theinstruction is re-executed by an execution unit 94) may be provided forthe L2 cache access of the desired data to be completed, therebypreventing a stall of the processor core 81.

FIG. 4 is a block diagram depicting an instruction prioritizationcircuitry 83 according to one embodiment of the invention. Theinstruction prioritization circuitry 83 enables optimizations which maybe achieved from the reordering of instructions as described in greaterdetail below with regard to FIG. 5. The instruction prioritizationcircuitry 83 can implement any number of different instructionoptimization schemes, including the one of the present invention, whichis to prioritize the instructions according to the priority order of theload instruction class.

An I-line buffer 82 may be used to store instructions fetched from theL1 I-cache 72. An I-line buffer 82 transfers the instructions to theinstruction prioritization circuitry 83 for optimizations. Optimizationsmay be achieved from the ordering of instructions in any number ofdifferent instruction optimization schemes, including the one of thepresent invention, which is to prioritize the instructions according tothe priority order of the load instruction class.

After receiving the instructions from the I-line buffer 82 theinstruction prioritization circuitry 83 loads each instruction into acorresponding preliminary pipeline 101. Illustrated in FIG. 4 are eightpipelines P0 through P7 for example purposes only, however, it isunderstood that any number of instruction pipelines can be utilized.Each preliminary pipeline 101 includes the full instruction as well asthe instruction opcode. The instruction information is then transferredthrough switching system 102 into multiplexer bank 103.

The opcode for each instruction in each pipeline is also transferred viabusline 106 into the class conflict detection logic 104. The classconflict detection logic 104 determines if any of the instructionopcodes would resolve to the same instruction pipeline and informs theclass selection logic 105 of any conflicts or collisions. The classselection logic 105 then utilizes the multiplexer bank 103 to reorderthe instructions into the first reorder pipelines 109.

The first reorder pipelines 109 enable the instruction prioritizationcircuitry 83 to organize the higher priority instructions into the lowerorder or least delayed pipelines. In the illustrated example, the loadinstructions are prioritized first using ordered priority list. Anexample of the ordered priority list includes but is not limited to thefollowing order list: LARX loads that reset a lock SMP semaphore(reservation reg.) (0), loads with a predictable load miss in theD-Cache (1), loads with unpredictable load miss in the D-Cache (2),loads with an address conflict with an earlier store instruction alreadyin the pipeline (3), loads with multiple dependent loads ( ormultiplies) following it on a dependent chain (4), loads with 1dependent load (or multiply) following it on a dependent chain (5),loads with 3 or more dependent ALU instructions following it on adependent chain (6), loads with update (auto increment) that have bothRT and RA(2) target results (7), loads with 1 dependent use of any kind,but not by an EOC type instruction (8), loads with a dependent use byonly an EOC type of instruction (9), and loads that do not have adependent reference of their target within the depth of the IQ (10), andschedule the instructions accordingly.

The instruction information is then transferred through switching system112 into multiplexer bank 113. The opcode for each instruction in eachpipeline is also transferred via busline 116 into the same classconflict detection logic 114. The same class conflict detection logic114 determines if any of the instruction opcodes would resolve to thesame instruction pipeline and informs the same class selection logic 115of any conflicts or collisions. The class selection logic 115 thenutilizes the multiplexer bank 113 to reorder the instructions into thesecond reorder pipelines 119. In the illustrated example, the loadinstructions are prioritized second using program order and are schedulethe instructions accordingly. The re-ordered instruction group in thesecond reorder pipelines 119 is then transferred into the issue anddispatch circuitry 84.

Issue and dispatch circuitry 84 may be used to group instructionsretrieved from the instruction prioritization circuitry 83 intoinstruction groups which may then be issued to the processor core 81 asdescribed below.

FIG. 5 is a flow chart illustrating an example of the operation of loadpriority issue process 200 for executing instructions in the delayedexecution pipeline according to one embodiment of the invention. In theillustrated example, the load instructions are prioritized first usingordered priority list.

In the case where load issue conflicts occur (i.e. two or more loadinstructions issue to the same pipeline), a prioritization or tiebreakerprocess is performed. This prioritization or tiebreaker process is todetermine which of the load issue conflict instructions is placed in theleast delayed pipeline and the other competing instructions placed inmore delayed pipelines based upon program order.

First at step 201, the load priority issue process 200 receives a groupof instructions that are to be executed as a group. At step 203, all ofthe instructions in the group were evaluated to determine if one or moreload instructions are present in the instruction group. At step 205, itis determined if the received instructions group contain loadinstructions. If it is determined at step 205 that there are not loadinstructions in the group, then the load priority issue process 200skips to step 219 to exit.

However, if it is determined that there are one or more loadinstructions in the instruction group, then the load instructions areselected out of the group at step 207. At step 211, all of the loadinstructions selected out of the issue group instruction group at step207 are prioritized based upon a priority list An example of the orderedpriority list includes but is not limited to the following order list:LARX loads that reset a lock SMP semaphore (reservation reg.) (0), loadswith a predictable load miss in the D-Cache (1), loads withunpredictable load miss in the D-Cache (2), loads with an addressconflict with an earlier store instruction already in the pipeline (3),loads with multiple dependent loads ( or multiplies) following it on adependent chain (4), loads with 1 dependent load (or multiply) followingit on a dependent chain (5), loads with 3 or more dependent ALUinstructions following it on a dependent chain (6), loads with update(auto increment) that have both RT and RA(2) target results (7), loadswith 1 dependent use of any kind, but not by an EOC type instruction(8), loads with a dependent use by only an EOC type of instruction (9),and loads that do not have a dependent reference of their target withinthe depth of the IQ (10), and schedule the instructions accordingly.

The priority, instruction class and priority reason are shown inTable 1. Load Instruction Priority (0 is highest priority in thistable).

TABLE 1 Priority Instruction Class Priority Reason 0 LARX loads thatreset a lock SMP Required to issue only to a single pipelinesemiphore(reservation reg.) unit. Illustrated in this example—p6 1 Loadswith a predictable load miss Instructions following these loads are inthe DCache already delayed by 3 pipeline pairs and cannot or should notbe issued to a further delayed pipeline 2 Loads with unpredictable loadmiss Same as case 1 but the DCache miss will in the DCache happen onlysome of the time 3 Loads with an address conflict with The load mustissue to the same pipeline an earlier store instruction already in asthe store, so may already be delayed the pipeline and should not befurther delayed at issue 4 Loads with multiple dependent If the load isissued to p4 or p6, it will loads (or multiplies) following it on alikely cause a stall on the following dependent chain load/multiply, soshould not be further delayed 5 Loads with 1 dependent load (or If theload is issued to p6, it will likely multiply) following it on adependent cause a stall on the following load, and chain potentially soif issued to p4 6 Loads with 3 or more dependent If the load is issuedto p6, it may cause a ALU instructions following it on a stall laterwhen the dependent ALU ops dependent chain are executed in pipeline p7 7Loads with update (autoincrement) Twice as likely to get a dependent useof that have both RT and RA(2) target the targets later results 8 Loadswith 1 dependent use of any Single instruction in dependent chain kindbut not by an EOC type case (usually) instruction 9 Loads with adependent use by only Cannot cause a stall an EOC type of instruction 10Loads that do not have a dependent Look like instructions with noreference of their target within the dependencies depth of the IQ

For example, where the least delayed pipeline is the only pipeline inthe processor core 81 which performs a function required by anotherinstruction (e.g., if the least delayed pipeline is the only pipelinewhich can execute a branch instruction), the load instruction may beissued to another pipeline with more delay. Also, in some cases,execution of the load instruction may be dependent on the outcome ofother executed instructions. For example, the memory address of the datatargeted by the load instruction may be dependent on a calculationperformed by another instruction. Where the load instruction isdependent on another instruction in the same issue group, the otherinstruction may be executed before the load instruction, (e.g., using apipeline with less delay in execution). Optionally, in some cases, theinstructions in the issue group may be scheduled (e.g., by spreading theinstructions across multiple issue groups) so that such dependencies ina single issue group are avoided.

At step 213, the load priority issue process 200 determines if any issueconflicts exist. If it is determined at step 213 that no issue conflictsexist, then the load priority issue process 200 skips to step 219 toexit. However, if it is determined that an issue conflicts exist thenorder priorities are then implemented on the load instructions with theissue conflict at step 215.

One example for order priorities for load instructions is as follows. Inone embodiment, the load instructions with issue conflicts areprioritized based upon whether loads have Stores with 2 registers forAddress generation(X-form) and have priority over loads that have Storeswith 1 register plus displacement (D-form). In another embodiment, thepriority of load instructions with issue conflicts are determined bydependency chain depths or how many dependent loads will follow thisload instruction. In still another embodiment, the load instructionswith issue conflicts can be prioritized based upon the stall delayedpenalty. In still another embodiment, the load instructions with issueconflicts are prioritized based upon program order. For example, thoseloads with an issue conflict are prioritized in the order that theprogram code originally ordered them.

At step 217, the load priority issue process 200 issues a loadinstructions to the issue and dispatch circuitry 84. At step 219, theload priority issue process 200 exits.

The present invention can take the form of an entirely hardwareembodiment, an entirely software embodiment or an embodiment containingboth hardware and software elements. As one example, one or more aspectsof the present invention can be included in an article of manufacture(e.g., one or more computer program products) having, for instance,computer usable media. The media has embodied therein, for instance,computer readable program code means for providing and facilitating thecapabilities of the present invention. The article of manufacture can beincluded as a part of a computer system or sold separately.

Furthermore, the invention can take the form of a computer programproduct accessible from a computer-usable or computer-readable mediumproviding program code for use by or in connection with a computer orany instruction execution system. For the purposes of this description,a computer-usable or computer readable medium can be any apparatus thatcan contain, store, communicate, propagate, or transport the program foruse by or in connection with the instruction execution system,apparatus, or device.

The medium can be an electronic, magnetic, optical, electromagnetic,infrared, or semiconductor system (or apparatus or device) or apropagation medium. Examples of a computer-readable medium include asemiconductor or solid state memory, magnetic tape, a removable computerdiskette, a random access memory (RAM), a read-only memory (ROM), arigid magnetic disk and an optical disk. Current examples of opticaldisks include compact disk-read only memory (CD-ROM), compactdisk-read/write (CD-R/W) and DVD.

It should be emphasized that the above-described embodiments of thepresent invention, particularly, any “preferred” embodiments, are merelypossible examples of implementations, merely set forth for a clearunderstanding of the principles of the invention. Many variations andmodifications may be made to the above-described embodiment(s) of theinvention without departing substantially from the spirit and principlesof the invention. All such modifications and variations are intended tobe included herein within the scope of this disclosure and the presentinvention and protected by the following claims.

1. A method of scheduling execution of a load instruction in a processorhaving at least one cascaded delayed execution pipeline unit having aplurality of execution pipelines that execute instructions in a commonissue group in a delayed manner relative to each other, the methodcomprising: receiving an issue group of instructions; determining if atleast one load instruction is in the issue group, if so scheduling theleast one load instruction in a first pipeline based upon a prioritylist; and scheduling execution of the issue group of instructions in thecascaded delayed execution pipeline unit.
 2. The method of claim 1,wherein the priority list prioritizes the load instruction dealing withsemaphores as having a highest priority.
 3. The method of claim 1wherein the priority list prioritizes the load instruction dealing witha store address conflict as having a second highest priority.
 4. Themethod of claim 1, wherein the priority list prioritizes the loadinstruction dealing with a reliable miscount as having a third highestpriority.
 5. The method of claim 1, wherein the priority listprioritizes the load instruction dealing with a unreliable miscount ashaving a fourth highest priority.
 6. The method of claim 1, wherein thepriority list prioritizes the load instruction dealing with a dependentload as having a fifth highest priority.
 7. The method of claim 1,wherein the priority list prioritizes the load instruction dealing witha chained compare instruction as having a sixth highest priority.
 8. Themethod of claim 1, wherein the priority list prioritizes the loadinstruction dealing with a writeback instruction as having a seventhhighest priority.
 9. The method of claim 1, wherein the priority listprioritizes the load instruction dealing with a end of chain instructionas having an eight highest priority.
 10. An integrated circuit devicecomprising: a cascaded delayed execution pipeline unit having aplurality of execution pipelines that execute instructions in a commonissue group in a delayed manner relative to each other; circuitryconfigured to: receive an issue group of instructions; determine if atleast one load instruction is in the issue group, if so scheduling theleast one load instruction in a first pipeline based upon a prioritylist; and schedule execution of the issue group of instructions in thecascaded delayed execution pipeline unit.
 11. The integrated circuitdevice of claim 10, wherein the priority list prioritizes the loadinstruction dealing with semaphores as having a highest priority. 12.The integrated circuit device of claim 10, wherein the priority listprioritizes the load instruction dealing with a store address conflictas having a second highest priority
 13. The integrated circuit device ofclaim 10, wherein the priority list prioritizes the load instructiondealing with a reliable miscount as having a third highest priority. 14.The integrated circuit device of claim 10, wherein the priority listprioritizes the load instruction dealing with a unreliable miscount ashaving a fourth highest priority.
 15. The integrated circuit device ofclaim 10, wherein the priority list prioritizes the load instructiondealing with a dependent load as having a fifth highest priority. 16.The integrated circuit device of claim 10, wherein the priority listprioritizes the load instruction dealing with a chained compareinstruction as having a sixth highest priority.
 17. The integratedcircuit device of claim 10, wherein the priority list prioritizes theload instruction dealing with a writeback instruction as having aseventh highest priority.
 18. The integrated circuit device of claim 10,wherein the priority list prioritizes the load instruction dealing witha end of chain instruction as having an eight highest priority.
 19. Aprocessor comprising: a cascaded delayed execution pipeline unit havinga plurality of execution pipelines that execute instructions in a commonissue group in a delayed manner relative to each other; circuitryconfigured to: receive an issue group of instructions; determine if atleast one load instruction is in the issue group, if so scheduling theleast one load instruction in a first pipeline based upon a prioritylist; and schedule execution of the issue group of instructions in thecascaded delayed execution pipeline unit.
 20. The integrated circuitdevice of claim 10, wherein the priority list wherein the priority listprioritizes the load instruction dealing with semaphores as having ahighest priority, the load instruction dealing with a store addressconflict as having a second highest priority, the load instructiondealing with a reliable miscount as having a third highest priority, theload instruction dealing with a unreliable miscount as having a fourthhighest priority, the load instruction dealing with a dependent load ashaving a fifth highest priority, the priority list prioritizes the loadinstruction dealing with a chained compare instruction as having a sixthhighest priority, the load instruction dealing with a writebackinstruction as having a seventh highest priority, and the loadinstruction dealing with a end of chain instruction as having an eighthighest priority.